A Recursive Dual Minimum Algorithm
نویسندگان
چکیده
The various RDM learning algorithms are developed by choosing different Λ(θ) for LIP models, including Projection, Recursive Dual Minimum, Recursive Dual Mean Minimum, λ-weighted Dual M<inimum, Instantaneous RDM and Batch RDM algorithms. An exmaple is shown the applications in adaptive identification and control fields.
منابع مشابه
An Extended Note on the Comparison-optimal Dual-Pivot Quickselect
In this note the precise minimum number of key comparisons any dual-pivot quickselect algorithm (without sampling) needs on average is determined. The result is in the form of exact as well as asymptotic formulæ of this number of a comparison-optimal algorithm. It turns out that the main terms of these asymptotic expansions coincide with the main terms of the corresponding analysis of the class...
متن کاملGeneralized Predictive Control for a Class of Bilinear Systems
A new generalized predictive control algorithm for a kind of input-output bilinear system is proposed in the paper (BGPC). The algorithm combines bilinear and linear terms of I/O bilinear system, and constitutes an ARIMA model analogous to linear systems. Using optimization predictive information fully, the algorithm carries out multi-step predictions by recursive approximation. The heavy compu...
متن کاملSelf-dual Codes from Smaller Lengths of Self-dual Codes and Recursive Algorithm*
Self-dual codes have been received great attention by researchers since the beginning of the coding theory. In this work, some construction methods for this kind of codes are composed which produce new self-dual codes from self-dual codes of smaller lengths. A special one of these methods that is called recursive algorithm is also mentioned. For the binary case, it was shown that recursive algo...
متن کاملRecursive Dual-Net: A New Universal Network for Supercomputers of the Next Generation
In this paper, we propose a new universal network, called recursive dual-net (RDN), as a potential candidate for the interconnection network of supercomputers with very large scale. The recursive dual-net is based on a recursive dual-construction of a base network. A k-level dual-construction for k > 0 creates a network containing (2m) k /2 nodes with node-degree d + k, where m and d are the nu...
متن کاملRatio Cut Hypergraph Partitioning Using Bdd Based Mboa Optimization Algorithm
This paper deals with the k-way ratio cut hypergraph partitioning utilizing the Mixed discrete continuous variant of the Bayesian Optimization Algorithm (mBOA). We have tested our algorithm on three partitioning taxonomies: recursive minimum ratio cut, multi-way minimum ratio cut and recursive minimum cut bisection. We have also derived a new approach for modeling of Boolean functions using bin...
متن کامل